Gromov hyperbolic graphs arising from iterations
نویسندگان
چکیده
For a contractive iterated function system (IFS), it is known that there natural hyperbolic graph structure (augmented tree) on the symbolic space of IFS reflects relationship among neighboring cells, and its boundary with Gromov metric Hölder equivalent to attractor K [14], [26], [28]. This setup was taken up study probabilistic potential theory [21], [20], bi-Lipschitz equivalence [29]. In this paper, we formulate broad class graphs, called expansive capture most essential properties from augmented trees boundaries (e.g., special geodesics, bounded degree property, doubling equivalence). We also new “weighted” investigate connection self-similar energy form in analysis fractals.
منابع مشابه
Scaled Gromov hyperbolic graphs
In this paper, the δ-hyperbolic concept, originally developed for infinite graphs, is adapted to very large but finite graphs. Such graphs can indeed exhibit properties typical of negatively curved spaces, yet the traditional δ-hyperbolic concept, which requires existence of an upper bound on the fatness δ of the geodesic triangles, is unable to capture those properties, as any finite graph has...
متن کاملOrbit Spaces Arising from Isometric Actions on Hyperbolic Spaces
Let be a differentiable action of a Lie group on a differentiable manifold and consider the orbit space with the quotient topology. Dimension of is called the cohomogeneity of the action of on . If is a differentiable manifold of cohomogeneity one under the action of a compact and connected Lie group, then the orbit space is homeomorphic to one of the spaces , , or . In this paper we suppo...
متن کاملNode Expansions and Cuts in Gromov-hyperbolic Graphs
Gromov-hyperbolic graphs (or, hyperbolic graphs for short) are a non-trivial interesting classes of “non-expander” graphs. Originally conceived by Gromov in 1987 in a different context while studying fundamental groups of a Riemann surface, the hyperbolicity measure for graphs has recently been a quite popular measure in the network science community in quantifying ”curvature” and “closeness to...
متن کاملRandom Regular Graphs are not Asymptotically Gromov Hyperbolic
In this paper we prove that random d–regular graphs with d ≥ 3 have traffic congestion of the order O(n log3d−1(n)) where n is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically δ–hyperbolic for any non–negative δ almost surely as n→∞.
متن کاملGromov Hyperbolic Spaces
A mini monograph on Gromov hyperbolic spaces, which need not be geodesic or proper.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2021
ISSN: ['1857-8365', '1857-8438']
DOI: https://doi.org/10.1016/j.aim.2021.107908